The More Organized Proof For Acyclic Coloring Of Graphs With Δ = 5 with 8 Colors
نویسنده
چکیده
An acyclic coloring of a graph G is a coloring of its vertices such that:(i) no two neighbors in G are assigned the same color and (ii) no bicolored cycle can exist in G. The acyclic chromatic number of G is the least number of colors necessary to acyclically color G. Recently it has been proved that any graph of maximum degree 5 has an acyclic chromatic number at most 8. In this paper we present another proof for this result. Keywords—Acyclic Coloring,Vertex coloring.
منابع مشابه
Acyclic edge coloring of planar graphs with Δ colors
An acyclic edge coloring of a graph is a proper edge coloring without bichromatic cycles. In 1978, it was conjectured that ∆(G) + 2 colors suffice for an acyclic edge coloring of every graph G [6]. The conjecture has been verified for several classes of graphs, however, the best known upper bound for as special class as planar graphs are, is ∆+12 [2]. In this paper, we study simple planar graph...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملAcyclic edge coloring of subcubic graphs
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using 5 colors. This result is tight since there are...
متن کاملA new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملColoring with no 2-Colored P4's
A proper coloring of the vertices of a graph is called a star coloring if every two color classes induce a star forest. Star colorings are a strengthening of acyclic colorings, i.e., proper colorings in which every two color classes induce a forest. We show that every acyclic k-coloring can be refined to a star coloring with at most (2k2 − k) colors. Similarly, we prove that planar graphs have ...
متن کامل